Memory system performance of programs with intensive heap allocation
نویسندگان
چکیده
منابع مشابه
Compressing heap data for improved memory performance
We introduce a class of transformations that modify the representation of dynamic data structures used in programs with the objective of compressing their sizes. Based upon a profiling study of data value characteristics, we have developed the common-prefix and narrow-data transformations that respectively compress a 32 bit address pointer and a 32 bit integer field into 15 bit entities. A pair...
متن کاملHeap Data Allocation to Scratch-Pad Memory in Embedded Systems
Title of dissertation: HEAP DATA ALLOCATION TO SCRATCH-PAD MEMORY IN EMBEDDED SYSTEMS Angel Dominguez Doctor of Philosophy, 2007 Dissertation directed by: Professor Rajeev K. Barua Department of Electrical and Computer Engineering This thesis presents the first-ever compile-time method for allocating a portion of a program’s dynamic data to scratch-pad memory. A scratch-pad is a fast directly a...
متن کاملBalanced Allocation: Memory Performance Tradeoffs
Suppose we sequentially put n balls into n bins. If we put each ball into a random bin then the heaviest bin will contain ∼ logn/ log logn balls with high probability. However, Azar, Broder, Karlin and Upfal [SIAM J. Comput. 29 (1999) 180–200] showed that if each time we choose two bins at random and put the ball in the least loaded bin among the two, then the heaviest bin will contain only ∼ l...
متن کاملSatisfiability Modulo Heap-Based Programs
In this work, we present a semi-decision procedure for a fragment of separation logic with user-defined predicates and Presburger arithmetic. To check the satisfiability of a formula, our procedure iteratively unfolds the formula and examines the derived disjuncts. In each iteration, it searches for a proof of either satisfiability or unsatisfiability. Our procedure is further enhanced with aut...
متن کاملMeasuring the Heap Allocation of Napier88
This report summarises work performed on measuring the heap allocation of the persistent programming language Napier88. The experiments conducted were based on traces produced by a modified Napier88 interpreter. They showed the surprising fact that arout 86% of the transient objects allocated died before 100 other allocations took place. This rate is very high and implies that Napier88 would be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computer Systems
سال: 1995
ISSN: 0734-2071,1557-7333
DOI: 10.1145/210126.210129